A Characterization of Graphs with No Octahedron Minor
نویسنده
چکیده
It is proved that a graph does not contain an octahedron minor if and only if it is constructed from {K1,K2,K3,K4}∪{C 2 2n−1 : n ≥ 3} and five other internally 4-connected graphs by 0-, 1-, 2-, and 3-sums.
منابع مشابه
A characterization of some graph classes using excluded minors
In this article we present a structural characterization of graphs without K5 and the octahedron as a minor. We introduce semiplanar graphs as arbitrary sums of planar graphs, and give their characterization in terms of excluded minors. Some other excluded minor theorems for 3-connected minors are shown.
متن کاملK6-Minors in Triangulations on the Nonorientable Surface of Genus 3
It is easy to characterize graphs with no Kk-minors for any integer k ≤ 4, as follows. For k = 1, 2, the problem must be trivial, and for k = 3, 4, those graphs are forests and series-parallel graphs (i.e., graphs obtained from K3 by a sequence of replacing a vertex of degree 2 with a pair of parallel edges, or its inverse operation.) Moreover, Wagner formulated a fundamental characterization o...
متن کامل-λ coloring of graphs and Conjecture Δ ^ 2
For a given graph G, the square of G, denoted by G2, is a graph with the vertex set V(G) such that two vertices are adjacent if and only if the distance of these vertices in G is at most two. A graph G is called squared if there exists some graph H such that G= H2. A function f:V(G) {0,1,2…, k} is called a coloring of G if for every pair of vertices x,yV(G) with d(x,y)=1 we have |f(x)-f(y)|2 an...
متن کاملA Characterization of K2, 4-Minor-Free Graphs
We provide a complete structural characterization of K2,4-minor-free graphs. The 3-connected K2,4minor-free graphs consist of nine small graphs on at most eight vertices, together with a family of planar graphs that contains K4 and, for each n ≥ 5, 2n − 8 nonisomorphic graphs of order n. To describe the 2-connected K2,4-minor-free graphs we use xy-outerplanar graphs, graphs embeddable in the pl...
متن کاملProjective-Planar Graphs with No K3, 4-Minor
There are several graphs H for which the precise structure of graphs that do not contain a minor isomorphic to H is known. In particular, such structure theorems are known for K5 [13], V8 [8] and [7], the cube [3], the octahedron [4], and several others. Such characterizations can often be very useful, e.g., Hadwiger’s conjecture for k = 4 is verified by using the structure for K5-free graphs, ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Journal of Graph Theory
دوره 74 شماره
صفحات -
تاریخ انتشار 2013